Correlation Analysis of Summation Generator
نویسندگان
چکیده
J. Dj. Golić applied linear sequential circuit approximation (LSCA) method to analyze the summation generator with an arbitrary number of inputs. He conjectured that he could obtain all pairs of mutually correlated input and output linear functions with the maximum possible absolute value of the correlation coefficient by this method, but he did not give any proof. By using Walsh Transformation technique, the conjecture is proved for even n in this paper. The “total correlation” of summation generator is studied which is very similar to that of combiners with one bit memory.
منابع مشابه
On an improved summation generator with 2-bit memory
The summation generator is a real adder generator with a maximum period, near-maximum linear complexity and maximum order of correlation immunity. However it is neither secure against and nor immune to correlation attack between its output sequences and carry sequences in special cases. A modi"ed summation generator, secure against such an attack, has recently been proposed, but no proof is giv...
متن کاملN-adic Summation-Shrinking Generator. Basic properties and empirical evidences
The need of software-flexible stream ciphers has led to several alternative proposals in the last few years. One of them is a new Pseudo Random Number Generator (PRNG), named N-adic Summation-Shrinking (NSumSG), which architecture is described in this paper. It uses N-1 parallel working slave summation generators and one N-adic summation generator, controlling the nonlinearity in the generator....
متن کاملMatrix-Variate Beta Generator - Developments and Application
Matrix-variate beta distributions are applied in different fields of hypothesis testing, multivariate correlation analysis, zero regression, canonical correlation analysis and etc. A methodology is proposed to generate matrix-variate beta generator distributions by combining the matrix-variate beta kernel with an unknown function of the trace operator. Several statistical characteristics, exten...
متن کاملAlgebraic Attacks on Summation Generators
We apply the algebraic attacks on stream ciphers with memories to the summation generator. For a summation generator that uses n LFSRs, an algebraic equation relating the key stream bits and LFSR output bits can be made to be of degree less than or equal to 2dlog2 ne, using dlog2 ne + 1 consecutive key stream bits. This is much lower than the upper bound given by previous general results. We al...
متن کاملA Systematic Procedure for Applying
A systematic procedure for applying fast correlation attacks to combiners with memory is introduced. This procedure consists of the following four stages: identifying correlated linear input and output transforms with maximum possible or relatively large correlation coeecient, calculating low-weight polynomial multiples based on the identiied input linear transform, applying an iterative error ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003